Analysis of a new skip list variant
نویسندگان
چکیده
Skip lists were introduced by Pugh (10) and analysed in (7; 4; 9) and also some other papers. We assume that the reader has a certain familiarity with skip lists, if (s)he wants to understand the origin of the problem. To understand the analysis that we perform, no such prerequisites are necessary. The variation that was suggested in (1) is best understood looking at the following example, taken from (1): The data (3; 6; 7; 9; 12; 17; 19; 21; 25; 26) have a certain level associated to them, which follows the geometric law Pflevel is = kg = pqk 1. And they are linked as indicated, which one can easily understand from the diagram.
منابع مشابه
Improved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملAn Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem
Given a pattern and text, both over a common ordered alphabet, the orderpreserving pattern matching problem consists in finding all substrings of the text with the same relative order as the pattern. This problem, an approximate variant of the well-known exact pattern matching problem, finds applications in such fields as time series analysis (e.g., share prices on stock markets), weather data ...
متن کاملA Service-oriented Scalable Dictionary in MPI
In this paper we present a distributed, in-memory, message passing implementation of a dynamic ordered dictionary structure. The structure is based on a distributed fine-grain implementation of a skip list that can scale across a cluster of multicore machines. We present a service-oriented approach to the design of distributed data structures in MPI where the skip list elements are active proce...
متن کاملSimplified Self-Adapting Skip Lists
The Simplified Self-Adapting Skip List, a practical new extension of the Skip List data structure, is designed for use with data that exhibit bias, that is, a nonuniform distribution of queries to set elements. The structure observes an initially unknown degree of bias in queries to a data set and adapts itself to a consistently nearly-optimal configuration, improving search efficiency and spee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006